Path planning of mobile robot based on particle swarm optimization algorithm

نویسندگان

چکیده

Abstract Aiming at the premature convergence problem of particle swarm optimization (PSO) due to loss population diversity in late stage search, this paper improves traditional PSO and proposes elite mean deviation induction strategy, which speed accuracy PSO. The experimental results show that improved are improved. effectiveness algorithm is proved.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robot Path Planning Based on Random Coding Particle Swarm Optimization

Mobile robot navigation is to find an optimal path to guide the movement of the robot, so path planning is guaranteed to find a feasible optimal path. However, the path planning problem must be solve two problems, i.e., the path must be kept away from obstacles or avoid the collision with obstacles and the length of path should be minimized. In this paper, a path planning algorithm based on ran...

متن کامل

A Global Path Planning Approach Based on Particle Swarm Optimization for a Mobile Robot

A new global path planning approach based on particle swarm optimization (PSO) for a mobile robot in a static environment is presented. Consider path planning as an optimization problem with constraints. The constraints are the path can not pass by the obstacles. The optimization target is the path is shortest. The obstacles in the robot’s environment are described as polygons and the vertexes ...

متن کامل

Smooth Path Planning for Mobile Robot Using Particle Swarm Optimization and Radial Basis Functions

One of the most important tasks to be performed by a mobile robot is to find a collision-free and smooth path to follow. Given a set of initial control points and using a Radial Basis Function (RBF), a method is proposed, in which is used the RBF’s property to approximate smooth functions to define a collision-free and short path. In this paper we formulate the training technique of an RBF as a...

متن کامل

Mobile Robot Path Planning in Static Environments using Particle Swarm Optimization

Motion planning is a key element of robotics since it empowers a robot to navigate autonomously. Particle Swarm Optimization is a simple, yet a very powerful optimization technique which has been effectively used in many complex multi-dimensional optimization problems. This paper proposes a path planning algorithm based on particle swarm optimization for computing a shortest collision-free path...

متن کامل

Mobile Robot Dynamic Path Planning Based on Genetic Algorithm

In dynamic environment, the path planning of mobile robot is a problem difficult to solve. A path planning method for mobile robot based on genetic algorithm is put forward. This method makes use of real number coding and adaptive function with definite physical meaning in the dynamic environment so as to accelerate real-time calculation and improve calculation precision. The simulation result ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of physics

سال: 2021

ISSN: ['0022-3700', '1747-3721', '0368-3508', '1747-3713']

DOI: https://doi.org/10.1088/1742-6596/2093/1/012013